Discretization of numerical attributes for Knowledge EXplorer
نویسنده
چکیده
The paper describes an algorithm for discretization (categoriza-tion) of numerical attributes in Knowledge EXpolorer (Kex). The idea is to discretize the numerical attribute(s) in such way, that the resulting categorization ts the way how Knowledge Explorer creates the knowledge base. Experimental results show a comparison of performance of Kex, KnowledgeSeeker and CN4 on an economic data set containing a mixture of categorial and numerical attributes.
منابع مشابه
Empirical comparisons of various discretizationprocedures
The genuine symbolic machine learning (ML) algorithms are capable of processing symbolic, categorial data only. However, real-world problems, e.g. in medicine or nance, involve both symbolic and numerical attributes. Therefore, there is an important issue of ML to discretize (categorize) numerical attributes. There exist quite a few discretization procedures in the ML eld. This paper describes ...
متن کاملContinuous Classes in Rule Induction: Empirical Comparison of Two Approaches
This paper introduces modiication of two existing rule-inducing ML algorithms; they are now capable of processing continuous classes. The rst one is the CN4 algorithm, a large extension of the well-known CN2. It invokes its discretization procedure and also deals with continuous classes within the inductive process itself, i.e., 'on-line'. The other ML system, KEX (Knowledge EXplorer), treats n...
متن کاملAction Rules Discovery Based on Tree Classifiers and Meta-actions
Action rules describe possible transitions of objects from one state to another with respect to a distinguished attribute. Early research on action rule discovery usually required the extraction of classification rules before constructing any action rule. Newest algorithms discover action rules directly from a decision system. To our knowledge, all these algorithms assume that all attributes ar...
متن کاملDiscovering Interesting Patterns in Numerical Data with Background Knowledge
Association rule mining (Agrawal, Imielinski & Swami, 1993) is one of the most important data mining tasks. Initially only simple conjunctions of items were allowed as patterns, but generalizations of the framework to other pattern types such as sequences, trees, graphs etc. have been developed, significantly expanding its applicability. Curiously there has been relatively little effort devoted...
متن کاملEuropean and American put valuation via a high-order semi-discretization scheme
Put options are commonly used in the stock market to protect against the decline of the price of a stock below a specified price. On the other hand, finite difference approach is a well-known and well-resulted numerical scheme for financial differential equations. As such in this work, a new spatial discretization based on finite difference semi-discretization procedure with high order of accur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993